Computation with Advice
نویسندگان
چکیده
منابع مشابه
Online Computation with Advice
We consider a model for online computation in which the online algorithm receives, together with each request, some information regarding the future, referred to as advice. The advice provided to the online algorithm may allow an improvement in its performance, compared to the classical model of complete lack of information regarding the future. We are interested in the impact of such advice on...
متن کاملComputation with Advice
Computation with advice is suggested as generalization of both computation with discrete advice and Type-2 Nondeterminism. Several embodiments of the generic concept are discussed, and the close connection to Weihrauch reducibility is pointed out. As a novel concept, computability with random advice is studied; which corresponds to correct solutions being guessable with positive probability. In...
متن کاملPolynomial time quantum computation with advice
Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum state. The notion of advised quantum computation has a direct connection to non-uniform quantum circuits and tally languages. The paper examines the influence of such advice on the behaviors of an underlying polynomial-t...
متن کاملAdvice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particular importance in the quantum case, due to a surprising result that we prove: a quantum finite automaton with just two states can be sensitive to arbitrarily small changes in a coin’s bias. This contrasts with classica...
متن کاملAdvice and Randomization in Online Computation
Online computation is both of theoretical interest and practical relevance as numerous computational problems require a model in which algorithms do not know the whole input at every time step during runtime. The established measurement for the output quality of these online algorithms is the so-called competitive analysis, introduced by Sleator and Tarjan in 1985. Similar to the decrease in ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.24.9